As standard Backtracking Search Optimization Algorithm (BSA) has the shortcoming of slow convergence, a new mutation scale factor based on Maxwell-Boltzmann distribution and a crossover strategy with greedy property were introduced to improve it. Maxwell-Boltzmann distribution was used to generate mutation scale factor, which could enhance search efficiency and convergence speed. Mutation population learning from outstanding individuals was adopted in less exchange-dimensional crossover strategy to add greedy property to crossover as well as fully ensure population diversity, which managed to avoid the problem that most existed algorithms easily trap into local minima when added greedy property. The simulation experiments were conducted on fifteen Benchmark functions. The results show that the improved algorithm has faster convergence speed and higher convergence precision, even in the high-dimensional multimodal functions, the improved algorithm's search results are nearly 14 orders of magnitude higher than those of original BSA after the same iterations, and its convergence precision can reach 10-10 or less.
Current intrusion detection systems lack the ability to generalize from previously observed attacks and to detect even slight variations of known attacks. An approach employing LS and neural networks was described to provide the ability to generalize from previously observed behavior and to recognize future unseen behavior. The method was represented to use feedback neural networks in anomaly detection to structure the characteristic pattern of the short sequences of system calls. Meanwhile, the algorithm and design of the neural network were given. Experiment shows that the neural network is especially better to deal with events and variance of intrusions and improves the detection rate without increasing the false positives.